package 完全二叉树的节点个数;



public class Test {
    public static void main(String[] args) {
        Solution solution = new Solution();
        TreeNode p = new TreeNode(1);
        p.left = new TreeNode(2);
        p.right = new TreeNode(3);

        System.out.println(solution.countNodes(p));
    }

}
